Fast nearest-neighbor search algorithms based on approximation-elimination search
نویسندگان
چکیده
In this paper, we provide an overview of fast nearest-neighbor search algorithms based on an &approximation}elimination' framework under a class of elimination rules, namely, partial distance elimination, hypercube elimination and absolute-error-inequality elimination derived from approximations of Euclidean distance. Previous algorithms based on these elimination rules are reviewed in the context of approximation}elimination search. The main emphasis in this paper is a comparative study of these elimination constraints with reference to their approximation}elimination e$ciency set within di!erent approximation schemes. ( 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
منابع مشابه
An Efficient Approximation-elimination Algorithm for Fast Nearest-neighbor Search
In this paper, we present an efficient algorithm for fast nearest-neighbour search in multidimensional space under a so called approximation-elimination framework. The algorithm is based on a new approximation procedure which selects codevectors for distance computation in the close proximity of the test vector and eliminates codevectors using the triangle inequality based elimination. The algo...
متن کاملAn efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation
Ramasubramanian, V. and K.K. Paliwal, An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation, Pattern Recognition Letters 13 (1992) 471-480. An efficient approximation-elimination search algorithm for fast nearest-neighbour search is proposed based on a spherical distance coordinate formuTation, where a vector in K...
متن کاملA Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
A new fast nearest neighbor algorithm is described that uses principal component analysis to build an efficient search tree. At each node in the tree, the data set is partitioned along the direction of maximum variance. The search algorithm efficiently uses a depth-first search and a new elimination criterion. The new algorithm was compared to sixteen other fast nearest neighbor algorithms on t...
متن کاملFast Large-Scale Approximate Graph Construction for NLP
Many natural language processing problems involve constructing large nearest-neighbor graphs. We propose a system called FLAG to construct such graphs approximately from large data sets. To handle the large amount of data, our algorithm maintains approximate counts based on sketching algorithms. To find the approximate nearest neighbors, our algorithm pairs a new distributed online-PMI algorith...
متن کاملVoronoi Projection-Based Fast Nearest-Neighbor Search Algorithms: Box-Search and Mapping Table-Based Search Techniques
In this paper we consider fast nearest-neighbor search techniques based on the projections of Voronoi regions. The Voronoi diagram of a given set of points provides an implicit geometric interpretation of nearest-neighbor search and serves as an important basis for several proximity search algorithms in computational geometry and in developing structure-based fast vector quantization techniques...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition
دوره 33 شماره
صفحات -
تاریخ انتشار 2000